Fast scans on key-value stores
نویسندگان
چکیده
منابع مشابه
Fast Scans on Key-Value Stores
Key-Value Stores (KVS) are becoming increasingly popular because they scale up and down elastically, sustain high throughputs for get/put workloads and have low latencies. KVS owe these advantages to their simplicity. This simplicity, however, comes at a cost: It is expensive to process complex, analytical queries on top of a KVS because today’s generation of KVS does not support an efficient w...
متن کاملFast Column Scans: Paged Indices for In-Memory Column Stores
Commodity hardware is available in configurations with huge amounts of main memory and it is viable to keep large databases of enterprises in the RAM of one or a few machines. Additionally, a reunification of transactional and analytical systems has been proposed to enable operational reporting on the most recent data. In-memory column stores appeared in academia and industry as a solution to h...
متن کاملHardware Acceleration of Key-Value Stores
In-memory key-value stores are an important part of many datacenter applications. Web applications frequently use such software to cache the results of frequently recurring computations. Reducing the latency of key-value lookups will therefore go a long way towards improving total request latency. As a significant portion of the processing time for a request is due to the OS and application ove...
متن کاملLoad balancing for Key Value Data Stores
In the last decade new scalable data stores have emerged in order to process and store the increasing amount of data that is produced every day. These data stores are inherently distributed to adapt to the increasing load and generated data. HBase is one of such data stores built after Google BigTable that stores large tables (hundreds of millions of rows) where data is stored sorted by key. A ...
متن کاملCumulusRDF: Linked Data Management on Nested Key-Value Stores
Publishers of Linked Data require scalable storage and retrieval infrastructure due to the size of datasets and potentially high rate of lookups on popular sites. In this paper we investigate the feasibility of using a distributed nested keyvalue store as an underlying storage component for a Linked Data server which provides functionality for serving Linked Data via HTTP lookups and in additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2017
ISSN: 2150-8097
DOI: 10.14778/3137628.3137659